COVERS IN HYPERGRAPHSLEHEL J.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 3; PP. 305-309; BIBL. 8 REF.Article

INTRODUCTION AU SOFTWARE GRAPHIQUE.LEHEL J.1973; SEMA-METRA-SF-80; FR.; DA. 1973; PP. (65P.); BIBL. 15 P.Report

DELTAHEDRA ARE REALIZABLE AS SIMPLICIAL CONVEX POLYHEDRALEHEL J.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO I; PP. 81-84; BIBL. 5 REF.Article

A characterization of totally balanced hypergraphsLEHEL, J.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 59-65, issn 0012-365XArticle

TRIANGLE-FREE PARTIAL GRAPHS AND EDGE COVERING THEOREMSLEHEL J; TUZA Z.1982; DISCRET MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 39; NO 1; PP. 59-65; BIBL. 4 REF.Article

The minimum number of triangles covering the edges of a graphLEHEL, J.Journal of graph theory. 1989, Vol 13, Num 3, pp 369-384, issn 0364-9024Article

ENSEMBLES D'ARTICULATION D'UN GRAPHELEHEL J; TUZA Z.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 30; NO 3; PP. 245-248; ABS. ENG; BIBL. 2 REF.Article

RECHENTECHNISCHE UNTERSUCHUNG DES U-BAHNGLEISES = ETUDE MATHEMATIQUE D'UNE LIGNE DE CHEMIN DE FER SOUTERRAINELEHEL J; MEGYERI J.1975; PERIOD. POLYTECH., CIV. ENGNG; HONGR.; DA. 1975; VOL. 19; NO 3-4; PP. 201-221; H.T. 1Article

A METHOD TO GENERATE GRACEFUL TREESGYARFAS A; LEHEL J.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 207-209; ABS. FRE; BIBL. 3 REF.Conference Paper

UPPER BOUND ON THE ORDER OF TAU -CRITICAL HYPERGRAPHSGYARFAS A; LEHEL J; TUZA Z et al.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 33; NO 2; PP. 161-165; BIBL. 8 REF.Article

Neighborhood perfect graphsLEHEL, J; TUZA, Z.Discrete mathematics. 1986, Vol 61, Num 1, pp 93-101, issn 0012-365XArticle

Covering and coloring problems for relatives of intervalsGYARFAS, A; LEHEL, J.Discrete mathematics. 1985, Vol 55, Num 2, pp 167-180, issn 0012-365XArticle

Effective on-line coloring of P₅-free graphsGYARFAS, A; LEHEL, J.Combinatorica (Print). 1991, Vol 11, Num 2, pp 181-284, issn 0209-9683Article

The irregularity strength of tP₃KINCH, L; LEHEL, J.Discrete mathematics. 1991, Vol 94, Num 1, pp 75-79, issn 0012-365XArticle

On-line and first fit colorings of graphsGYARFAS, A; LEHEL, J.Journal of graph theory. 1988, Vol 12, Num 2, pp 217-227, issn 0364-9024Article

Hypergraph families with bounded edge cover or transversal numberGYARFAS, A; LEHEL, J.Combinatorica (Print). 1983, Vol 3, Num 3-4, pp 351-358, issn 0209-9683Article

Potentiation of ionophorous anticoccidials with dihydroquinolines: reduction of adverse interactions with antimicrobialsLACZAY, P; VARGA, I; MORA, Z et al.International journal for parasitology. 1994, Vol 24, Num 3, pp 421-423, issn 0020-7519Article

Clumsy packing of dominoesGYARFAS, A; LEHEL, J; TUZA, Z et al.Discrete mathematics. 1988, Vol 71, Num 1, pp 33-46, issn 0012-365XArticle

Recognizing triangle-free graphs with induced path-cycle double covers is NP-completeJACOBSON, M. S; KEZDY, A. E; LEHEL, J et al.Networks (New York, NY). 1998, Vol 31, Num 1, pp 1-10, issn 0028-3045Article

φ-threshold and φ-tolerance chain graphsJACOBSON, M. S; LEHEL, J; LESNIAK, L. M et al.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 191-203, issn 0166-218XArticle

On-line 3-chromatic graphs I. Triangle-free graphsGYARFAS, A; KIRALY, Z; LEHEL, J et al.SIAM journal on discrete mathematics (Print). 1999, Vol 12, Num 3, pp 385-411, issn 0895-4801Article

M-Chain graphs of posetsLEHEL, J; MCMORRIS, F. R; SCOTT, D. D et al.Discrete mathematics. 1989, Vol 74, Num 3, pp 341-346, issn 0012-365XArticle

How many atoms can be defined by boxesGYARFAS, A; LEHEL, J; TUZA, Z et al.Combinatorica (Print). 1985, Vol 5, Num 3, pp 193-204, issn 0209-9683Article

Potentiation of ionophorous anticoccidials with dihydroquinolines: battery trials against Eimeria tenella in chickensVARGA, I; LACZAY, P; LEHEL, J et al.International journal for parasitology. 1994, Vol 24, Num 5, pp 689-694, issn 0020-7519Article

ADJACENT VERTEX DISTINGUISHING EDGE-COLORINGSBALISTER, P. N; GYÖRI, E; LEHEL, J et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 237-250, issn 0895-4801, 14 p.Article